Arrays, Numeration Systems and Games
نویسنده
چکیده
We deene an innnite array A of nonnegative integers based on a linear recurrence, which produces basis elements of an exotic ternary numeration system. Using the numeration system we explore many properties of A. Further, we propose and analyze a family of 2-player games on a variable number of heaps of tokens, and present a winning strategy based on certain subarrays of A. Though the strategy looks easy, it is actually computationally hard. The numeration system is then used to decide whether the family has an eecient strategy or not.
منابع مشابه
Arrays, numeration systems and Frankenstein games
We deene an innnite array A of nonnegative integers based on a linear recurrence, whose second row provides basis elements of an exotic ternary numeration system. Using the numeration system we explore many properties of A. Further, we propose and analyze a family Frankenstein of 2-player pebbling games played on a semi-innnite strip, and present a winning strategy based on certain subarrays of...
متن کاملHeap Games, Numeration Systems and Sequences
We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used, which enables us to decide whether the family has an efficient strategy or not. We introduce yet another class of sequences, and demonstrate its equivalence wi...
متن کاملA Cognitive Taxonomy of Numeration Systems
In this paper, we study the representational properties of numeration systems. We argue that numeration systems are distributed representationsÑrepresentations that are distributed across the internal mind and the external environment. We analyze number representations at four levels: dimensionality, dimensional representations, bases, and symbol representations. The representational properties...
متن کاملCobham’s Theorem for Abstract Numeration Systems
Abstract numeration systems generalize numeration systems whose representation map is increasing and such that the language of all the representations is regular. We show that if a set of integers is recognized by some finite automaton within two independent abstract numeration systems, then this set is a finite union of arithmetic progressions.
متن کاملThe signature of rational languages
We present here the notion of signature of trees and of languages, and its relationships with the theory of numeration systems. The signature of an ordered infinite tree (of bounded degree) is an infinite (bounded) sequence of integers, the sequence of the degrees of the nodes taken in the visit order of the canonical breadth-first traversal of the tree. A prefix-closed language defines such a ...
متن کامل